const math.shift

28 uses

	math (current package)
		bits.go#L13: 	shift    = 64 - 11 - 1
		bits.go#L16: 	fracMask = 1<<shift - 1
		floor.go#L94: 	e := uint(bits>>shift) & mask
		floor.go#L101: 	} else if e < bias+shift {
		floor.go#L106: 		const half = 1 << (shift - 1)
		floor.go#L133: 	e := uint(bits>>shift) & mask
		floor.go#L139: 		const halfMinusULP = (1 << (shift - 1)) - 1
		floor.go#L141: 		bits += (halfMinusULP + (bits>>(shift-e))&1) >> e
		frexp.go#L34: 	exp += int((x>>shift)&mask) - bias + 1
		frexp.go#L35: 	x &^= mask << shift
		frexp.go#L36: 	x |= (-1 + bias) << shift
		ldexp.go#L33: 	exp += int(x>>shift)&mask - bias
		ldexp.go#L48: 	x &^= mask << shift
		ldexp.go#L49: 	x |= uint64(exp+bias) << shift
		logb.go#L51: 	return int((Float64bits(x)>>shift)&mask) - bias + exp
		modf.go#L34: 	e := uint(x>>shift)&mask - bias
		sqrt.go#L110: 	exp := int((ix >> shift) & mask)
		sqrt.go#L112: 		for ix&(1<<shift) == 0 {
		sqrt.go#L119: 	ix &^= mask << shift
		sqrt.go#L120: 	ix |= 1 << shift
		sqrt.go#L128: 	r := uint64(1 << (shift + 1)) // r = moving bit from MSB to LSB
		sqrt.go#L143: 	ix = q>>1 + uint64(exp-1+bias)<<shift // significand + biased exponent
		trig_reduce.go#L39: 	exp := int(ix>>shift&mask) - bias - shift
		trig_reduce.go#L40: 	ix &^= mask << shift
		trig_reduce.go#L41: 	ix |= 1 << shift
		trig_reduce.go#L63: 	hi >>= 64 - shift
		trig_reduce.go#L65: 	hi |= e << shift